Delay-Optimal Buffer-Aware Scheduling With Adaptive Transmission
نویسندگان
چکیده
منابع مشابه
Power and Delay Optimal Transmission Scheduling: Small Delay Asymptotics
For wireless data traffic, energy efficiency can be improved by adapting the transmission power and rate over time based on the offered traffic as well as any channel state information. In this context, a variety of transmission scheduling approaches have been studied including [1, 2, 3]. These approaches attempt to manage the fundamental trade-off between packet delay and transmission power or...
متن کاملAdaptive Transmission Scheduling for Energy-Aware Real-Time Wireless Communication
Real-time low-power wireless networks are increasingly being used in applications such as: Industrial Internet-ofThings, Smart City technologies, and critical infrastructure monitoring. These networks typically use time-slotted superframe techniques to ensure real-time performance. Often the time slots are assigned statically, and energy conservation is regulated to other mechanisms such as dut...
متن کاملOptimal Transmission and Scheduling in Delay Tolerant Network
Delay-tolerant networking (DTN) is an approach to computer network architecture that seeks to address the technical issues in heterogeneous networks that may lack continuous network connectivity. Generally in networks the ability to transport, or route, data from a source to a destination is a fundamental ability all communication networks must have. Delay and disruption-tolerant networks (DTNs...
متن کاملOptimal Anticipative Scheduling with Asynchronous Transmission Opportunities
Service is provided to a set of parallel queues by a single server. The service of queue i may be initiated only at certain time instances ft i n g 1 n=1 that constitute the connectivity instances for queue i. The service of diierent customers cannot overlap. Scheduling is required to resolve potential contention of services initiated at closely spaced, closer than the service time, connectivit...
متن کاملRandomised Buffer Management with Bounded Delay against Adaptive Adversary
We study the Buffer Management with Bounded Delay problem, introduced by Kesselman et al. [4], or, in the standard scheduling terminology, the problem of online scheduling of unit jobs to maximise weighted throughput. The adaptive-online adversary model for this problem has recently been studied by Bieńkowski et al. [2], who proved a lower bound of 4 3 on the competitive ratio and provided a ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2017
ISSN: 0090-6778
DOI: 10.1109/tcomm.2017.2691711